| 翻訳と辞書 |
| Interval (graph theory) ： ウィキペディア英語版 |
Interval (graph theory)
In graph theory, an interval ''I''(''h'') in a directed graph is a maximal, single entry subgraph in which ''h'' is the only entry to ''I''(''h'') and all closed paths in ''I''(''h'') contain ''h''. Intervals were described in 1976 by F. E. Allen and J. Cooke. Interval graphs are integral to some algorithms used in compilers, specifically data flow analyses.
The following algorithm finds all the intervals in a graph consisting of vertices ''N'' and the entry vertex ''n''0, and with the functions pred(n) and succ(n) which return the list of predecessors and successors of a given node ''n'', respectively.
H = // Initialize work list
while H is not empty
remove next h from H
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Interval (graph theory)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|